Probabilistic Domains

نویسنده

  • Reinhold Heckmann
چکیده

We show the equivalence of several diierent axiomatizations of the notion of (abstract) probabilistic domain in the category of dcpo's and continuous functions. The axiomatization with the richest set of operations provides probabilistic selection among a nite number of possibilities with arbitrary probabilities, whereas the poorest one has binary choice with equal probabilities as the only operation. The remaining theories lie in between; one of them is the theory of binary choice by Graham 1].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Random Variables over Domains

In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabilistic computation within domain theory. Our approach relies on new results about commutative monoids defined on domains that also allow actions of the non-negative reals. Using our approach, we define two such familie...

متن کامل

QRB-Domains and the Probabilistic Powerdomain

Is there any cartesian-closed category of continuous domains that would be closed under Jones and Plotkin’s probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages. We relax the question, and look for quasi-continuous dcpos instead. We introduce a natural class of such quasi-continuous dcpos, the !QRB-dom...

متن کامل

Probabilistic Inference in Hybrid Domains

This extended abstract presents my PhD research project on learning and reasoning in Hybrid Domains. In particular, it focuses on my current work on exact probabilistic inference in these domains, as well as presenting other research directions that are going to be explored.

متن کامل

MAXPLAN: A New Approach to Probabilistic Planning

Classical arti cial intelligence planning techniques can operate in large domains but traditionally assume a deterministic universe. Operations research planning techniques can operate in probabilistic domains but break when the domains approach realistic sizes. maxplan is a new probabilistic planning technique that aims at combining the best of these two worlds. maxplan converts a planning ins...

متن کامل

Semantic Domains for Combining Probability and Non-Determinism

We present domain-theoretic models that support both probabilistic and nondeterministic choice. In [36], Morgan and McIver developed an ad hoc semantics for a simple imperative language with both probabilistic and nondeterministic choice operators over a discrete state space, using domaintheoretic tools. We present a model also using domain theory in the sense of D.S. Scott (see e.g. [15]), but...

متن کامل

Probabilistic Power Domains, Information Systems, and Locales

The probabilistic power domain construction of Jones and Plotkin 6, 7] is deened by a construction on dcpo's. We present alternative deenitions in terms of information systems a la Vickers 12], and in terms of locales. On continuous domains, all three deenitions coincide.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994